Functional interpretation and inductive definitions
نویسندگان
چکیده
Extending Gödel’s Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finite-type functionals defined using transfinite recursion on well-founded trees.
منابع مشابه
Realizability Interpretation of Generalized Inductive Definitions
Kobayashi, S. and M. Tatsuta, Realizability interpretation of generalized inductive definitions, Theoretical Computer Science 131 (1994) 121-138. Generalized inductive definitions give a way of defining a predicate as the least solution P of the equation P-A [P] where a predicate variable P may occur in a formula A[P] positively. This paper gives a q-realizability interpretation of generalized ...
متن کاملAbstract Interpretation of Non-monotone Bi-inductive Semantic Definitions
Interpretation of Non-monotone Bi-inductive Semantic Definitions ,
متن کاملProgram extraction via typed realisability for induction and coinduction
We study a realisability interpretation for interleaved inductive and coinductive definitions and discuss its application to program extraction in constructive analysis. A speciality of this interpretation is that realisers are given by terms that correspond directly to programs in a lazy functional programming language such as Haskell.
متن کاملA Curry-Style Realizability Interpretation for Monotone Inductive Definitions
The logical system AF2μ, an extension of second-order predicate calculus with monotone inductive definitions, is presented. Some properties of this system are shown including that it is a good system for extracting programs from proofs by means of a realizability interpretation in the style of Krivine-Parigot, where the realizers are terms of the Curry-system of λ-calculus and the realizability...
متن کاملContextual equivalence for inductive definitions with binders in higher order typed functional programming
Correct handling of names and binders is an important issue in meta-programming. This paper presents an embedding of constraint logic programming into the αML functional programming language, which provides a provably correct means of implementing proof search computations over inductive definitions involving names and binders modulo α-equivalence. We show that the execution of proof search in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 74 شماره
صفحات -
تاریخ انتشار 2009